Fbmc-mimo transmission/reception system with ml detection

ABSTRACT

A transmitter of an FBMC-MIMO system in which, for each FBMC-OQAM modulator associated with a transmission antenna, the symbols of a block to be transmitted are grouped in pairs, the input symbols in a pair being combined to output first and second combined symbols, the combined symbols being input to the FBMC-OQAM modulator. The invention also relates to a receiver including an FBMC-OQAM demodulator (4101, . . . ,410NR) and an ML detector (450k) from the observables obtained, for each reception antenna. The used ML detection allows for not being affected by intrinsic interference and obtaining a high degree of diversity without increasing the number of antennas.

TECHNICAL DOMAIN

This invention generally relates to the field of telecommunication systems using a Filter Bank Multi-Carrier modulation, also called FBMC systems. It also relates to Multiple Input Multiple Output (MIMO) telecommunication systems.

STATE OF PRIOR ART

Telecommunication systems using multi-carrier modulation are well known in the state of the art. The principle of such a modulation consists of dividing the transmission band into a plurality of frequency sub-channels associated with sub-carriers and modulating each of these sub-carriers with the data to be transmitted.

The most widespread multi-carrier modulation is undoubtedly OFDM (Orthogonal Frequency Division Multiplexing) modulation. This modulation is used in WLAN, Wifi wireless local networks, in high speed wireless internet access (WiMAX), digital radio broadcasting systems (DVB-T, ISDB-T, DAB), asymmetric digital links (xDSL), etc.

In an OFDM transmission system, each block of OFDM symbols is preceded by a guard interval or a cyclic prefix longer than the time spread of the pulse response of the channel, so as to eliminate inter-symbol interference. However, the insertion of a guard interval or a prefix causes a loss of spectral efficiency. Finally, OFDM modulation is not an optimum solution for applications requiring high out-of-band rejection rates because the spectral occupancy of an OFDM signal is significantly larger than the band of sub-carriers that it uses due to spreading of secondary lobes.

More recently an FBMC (Filter Bank Multi Carrier) modulation was proposed as an alternative to OFDM modulation.

The principle of FBMC modulation is based on a synthesis by filter bank on transmission and an analysis by filter bank on reception. Transmission and reception filters are versions of a prototype filter offset in frequency and in time.

An introduction to FBMC modulation is given in the article by B. Hirosaki entitled “An orthogonally multiplexed QAM system using the discrete Fourier transform” published in IEEE Trans on Comm., vol. 29 No. 7, pp. 982-989, July 1981, and in the article by P. Siohan et al. entitled “Analysis and design of OFDM/OQAM systems based on filterbank theory” published in IEEE Trans. on signal processing, vol. 50, No 5, pp. 1170-1183, May 2002.

An FBMC transmission/reception system can be represented in the time domain, or also in the frequency domain. A description of these two representations is given in the application published in reference FR-A-3003420 submitted in the name of this applicant.

In general, if the real symbols to be transmitted (in particular, these real symbols can be the real and imaginary parts of QAM symbols to be transmitted) are denoted x_(k,n), in which k is the index of the sub-carrier and n is the index of the symbols block, the signal transmitted by the FBMC transmitter can be written in base band in the following form:

$\begin{matrix} {{s(t)} = {\sum\limits_{k = 0}^{M - 1}{\sum\limits_{n \in Z}{x_{k,n}{g\left( {t - {n\frac{T}{2}}} \right)}e^{j\frac{2\pi}{T}{kT}}e^{j\; \varphi_{k,n}}}}}} & (1) \end{matrix}$

in which g(t) is the response of the prototype filter, T is the time interval separating two consecutive symbol blocks, and:

$\begin{matrix} {\varphi_{k,n} = {{\frac{\pi}{2}\left( {k + n} \right)} - {\pi \; {kn}}}} & (2) \end{matrix}$

is a phase term dependent on the time index n and the carrier index k.

The expression (1) can be written equivalently in a discrete form:

$\begin{matrix} {{s(m)} = {\sum\limits_{k = 0}^{M - 1}{\sum\limits_{n \in Z}{x_{k,n}{g_{k,n}(m)}\mspace{14mu} {in}\mspace{14mu} {which}}}}} & (3) \\ {{g_{k,n}(m)} = {{g\left( {m - {{nM}\text{/}2}} \right)}e^{j\frac{2\pi}{T}{k{({m - {D/2}})}}}e^{j\; \varphi_{k,n}}}} & (4) \end{matrix}$

is the response of the synthesis filter bank with the OQAM modulation, e^(jϕ) ^(k,n) being the above-mentioned phase term, in is a temporal index, M is the (even) number of sub-carriers, g(m) is the response of the prototype filter, g_(k,n)(m) is a version of the response of the prototype filter offset in time and frequency, weighted by a phase term representing the OQAM modulation, D=KM−1 in which K is the overlap factor of synthesis filters, or equivalently the pulse response of the prototype filter.

Assuming that the channel is not very selective in frequency (in other words it is said to be “flat” within a sub-channel) and has no delay, the response of the transmultiplexer filter (in other words the association of the synthesis filter bank and the analysis filter bank) corresponding to a unit excitation of the time-frequency pair (n₀,k₀) at the transmitter end in which n₀ is a time index and k₀ is a sub-carrier index, is given by:

$\begin{matrix} {r_{k^{\prime},n^{\prime}} = {{\sum\limits_{m = {- \infty}}^{+ \infty}{{g_{k_{0},n_{0}}(m)}g_{k^{\prime},n^{\prime}}^{*}}} = {e^{j\; {\pi {({k_{0} + {\delta \; k}})}}\delta \; n}e^{{- j}\frac{\pi}{2}{({{\delta \; k} + {\delta \; n}})}}{\sum\limits_{m = {- \infty}}^{+ \infty}{{g(m)}{g\left( {m - {\delta \; {n.M}\text{/}2}} \right)}e^{j\frac{2\; \pi}{M}\delta \; {k{({\frac{D}{2} - m})}}}}}}}} & (5) \end{matrix}$

in which δn=n′−n₀ and δk=k′−k₀. The prototype filter is chosen such that its pulse response satisfies the real orthogonality condition:

$\begin{matrix} {{\left( {\sum\limits_{m = {- \infty}}^{+ \infty}{{g_{k^{\prime},n^{\prime}}(m)}{g_{k,n}^{*}(m)}}} \right)} = {\delta_{k,k^{\prime}}\delta_{n,n^{\prime}}}} & (6) \end{matrix}$

in which

e is the real part and δ is the Kronecker symbol. It can be understood from expression (5) that interference affecting the real symbol x_(k,n) can be eliminated in that it is purely imaginary. More precisely, intrinsic interference, I_(k,n), in other words interference due to nearby symbols x_(k′,n′), (k′,n′)∈ Ω_(k,n) in which Ω_(k,n) is the time-frequency support of the response of the transmultiplexer filter centred on the x_(k,n) symbol, can be expressed as:

$\begin{matrix} {I_{k,n} = {\sum\limits_{{({k^{\prime},n^{\prime}})} \in \Omega_{k,n}}{x_{k^{\prime},n^{\prime 0}}{\sum\limits_{m = {- \infty}}^{+ \infty}{{g_{k^{\prime},n^{\prime}}(m)}{g_{k,n}^{*}(m)}}}}}} & (7) \end{matrix}$

This term is purely imaginary due to the OQAM modulation, in other words the alternation of real values and imaginary values due to the phase term e^(jϕ) ^(k,n) in expression (4). For this reason, it is denoted I_(k,n)=ji_(k,n). Note that interference i_(k,n) is generated by past and future symbols carried by the same carrier (k) and by adjacent carriers.

The following table represents the unit response r_(k,n) of the transmultiplexer filter corresponding to a unit excitation of the time-frequency pair (n₀,k₀) in the case in which the PHYDIAS filter is used with K=4:

n₀ − 3 n₀ − 2 n₀ − 1 n₀ n₀ + 1 n₀ + 2 n₀ + 3 k₀ − −0.043j −0.125 0.206j 0.239 −0.206j −0.125 0.423j 1 k₀ −0.067 0 0.564 1 0.564 0 −0.067 k₀ + 0.423j −0.125 −0.206j −0.239 0.206j −0.125 −0.043j 1

The signal received in base band at the output from the transmultiplexer filter of the receiver can be written:

y _(k,n) =h _(k,n)(x _(k,n) +ji _(k,n))+v _(k,n)   (8)

in which y_(k,n) is the complex symbol received at time n on carrier k, i_(k,n) is the above-mentioned interference term, h_(k,n) is the channel coefficient at time n for carrier k, and v_(k,n) is a noise term.

The FBMC modulation can be used for MIMO channels. In this case, the transmitter comprises N_(t)>1 transmission antennas and the receiver comprises N_(r)>1 reception antennas. Symbols to be transmitted are spatially multiplexed on different transmission antennas, one symbol flux being transmitted per antenna.

FIG. 1 diagrammatically shows an FBMC-MIMO transmission/reception system.

Symbols to be transmitted are denoted x_(k,n) ^(l) in which l=1, . . . , N_(T) is the index of the transmission antenna. Thus, symbol x_(k,n) ^(l) is transmitted by antenna l, on carrier k, at time n. Each antenna 120 is equipped with an FBMC-OQAM modulator, 110, composed of a OQAM modulator followed by a synthesis filter bank. The characteristics of synthesis filter banks associated with the different transmission antennas are identical. In particular, they are constructed using the same prototype filter.

Consequently, the modulator 110 generates the signal:

$\begin{matrix} {{s^{}(m)} = {\sum\limits_{k = 0}^{M - 1}{\sum\limits_{n \in Z}{x_{k,n}^{}{g_{k,n}(m)}}}}} & (9) \end{matrix}$

At the receiver end, the signals are received by the different reception antennas, 130 _(p), p=1, . . . , N_(R), each reception antenna 130 _(p) being equipped with an FBMC-OQAM demodulator, 140 _(p), composed of an analysis filter bank followed by an OQAM demodulator. The characteristics of analysis filter banks associated with the different reception antennas are identical. In particular, they are constructed using the same prototype filter. Complex symbols at the output from the demodulator 140 _(p), denoted y_(k,n) ^(p), are input to a detector, 150, giving estimated symbols {circumflex over (x)}_(k,n) ^(l).

Ignoring the temporal index to simplify matters, x_(k)=(x_(k,n) ¹, . . . , x_(k,n) ^(N) ^(T) )^(T) denotes the real vector of transmitted symbols, y_(k)=(y_(k,n) ¹, . . . , y_(k,n) ^(N) ^(R) )^(T) denotes the complex vector of received signals, i_(k)=(i_(k,n) ¹, . . . , i_(k,n) ^(N) ^(T) )^(T) denotes the vector representing interference, and H_(k) denotes the complex matrix with size N_(R)×N_(T) representing the MIMO channel at the frequency of carrier k, the relation (8) can be written in vector form:

y _(k) =H _(k)(x _(k) +ji _(k))+v _(k)   (10)

in which v_(k) is a noise vector.

Different types of detectors can be envisaged, particularly a Maximum Likelihood (ML) detector. Note that the principle of the ML detector is to search for:

y _(k) =H _(k)(x _(k) +ji _(k))+v _(k)   (11)

in which f_(k) is the maximum likelihood density of y_(k) relative to x_(k) (each element y_(k,n) ^(p) can be considered as a multidimensional random variable dependent on x_(k′,n′) ^(l) ∈Ω_(k,n)).

Alternatively, it would be possible to envisage a ZF (Zero Forcing) type detector making an estimate:

{circumflex over (x)}_(k) ^(ZF)=W_(k)y_(k)   (12)

in which W_(k)=(H_(k) ^(H)H, H_(k))⁻¹H_(k) ^(H) is the pseudo-inverse matrix of H_(k). However, it is known that a ZF detection amplifies the output noise and therefore it is not optimal. Consequently, it is preferred to use an ML detector.

However, it is very complex to use an ML detector because, as mentioned above, interference is generated by past and future symbols, both by the current carrier of the symbol considered and adjacent carriers. Assuming that the MIMO channel is known perfectly, the calculation requires that a very large number of possibilities is taken into account.

A transmission/reception system like that shown in FIG. 1 using an ML detector with soft outputs is described in the paper by M. Caus et al. entitled “Low-complexity soft-output MIMO detection in FBMC/OQAM systems” published in Proc. of Int'l Conf. on Circuits, Systems, Communications and Computers (ICCSCC), July 2014, pp. 25-29.

More precisely, this paper proposes to project equation (10) onto the real and imaginary axes, namely:

$\begin{matrix} {\begin{pmatrix} {\left( y_{k} \right)} \\ {\left( y_{k} \right)} \end{pmatrix} = {{\begin{pmatrix} {- \left( H_{k} \right)} & {\left( H_{k} \right)} \\ {\left( H_{k} \right)} & {\left( H_{k} \right)} \end{pmatrix}\begin{pmatrix} i_{k} \\ x_{k} \end{pmatrix}} + \begin{pmatrix} {\left( v_{k} \right)} \\ {\left( v_{k} \right)} \end{pmatrix}}} & (13) \end{matrix}$

in which

(.) and

(.) denote the real part and the imaginary part respectively. It will be noted that all elements used in the vectors and the matrix in equation (13) are reals.

A QR decomposition can be made on matrix

$\begin{matrix} {{\overset{\Cup}{H}}_{k} = \begin{pmatrix} {- \left( H_{k} \right)} & {\left( H_{k} \right)} \\ {\left( H_{k} \right)} & {\left( H_{k} \right)} \end{pmatrix}} & \; \end{matrix}$

with size 2N_(R)×2N_(T): H̆_(k)=Q_(k)R_(k) in which Q_(k) is an orthonormal matrix with size 2N_(R)×2N_(T) and R_(k) is an upper triangular matrix with size 2N_(T)×2N_(T), such that:

$\begin{matrix} {R_{k} = \begin{pmatrix} R_{k}^{11} & R_{k}^{12} \\ 0 & R_{k}^{22} \end{pmatrix}} & (14) \end{matrix}$

in which R_(k) ¹¹, R_(k) ¹², R_(k) ²² are real matrices with size N_(T)×N_(T).

Considering expressions (13) and (14), we obtain:

$\begin{matrix} {{Q_{k}^{T}\begin{pmatrix} {\left( y_{k} \right)} \\ {\left( y_{k} \right)} \end{pmatrix}} = {{\begin{pmatrix} R_{k}^{11} & R_{k}^{12} \\ 0 & R_{k}^{22} \end{pmatrix}\begin{pmatrix} i_{k} \\ x_{k} \end{pmatrix}} + {Q_{k}^{T}\begin{pmatrix} {\left( v_{k} \right)} \\ {\left( v_{k} \right)} \end{pmatrix}}}} & (15) \end{matrix}$

and therefore, if {tilde over (y)}_(k)=(q_(k) ^(N) ^(r+1) , . . . , q_(k) ^(2N) ^(T) )^(T)y̆_(k) denotes the projection of the real vector

${\overset{\Cup}{y}}_{k} = \begin{pmatrix} {\left( y_{k} \right)} \\ {\left( y_{k} \right)} \end{pmatrix}$

onto the N_(T) last column vectors of Q_(k), expression (13) gives:

{tilde over (y)} _(k) =R _(k) ²² x _(k) +{tilde over (v)} _(k)   (16)

in which {tilde over (v)}_(k)=(q_(k) ^(N) ^(r+1) , . . . , q_(k) ^(2N) ^(T) )^(T)v̆_(k) is the real noise vector

${\overset{\Cup}{v}}_{k} = \begin{pmatrix} {\left( v_{k} \right)} \\ {\left( v_{k} \right)} \end{pmatrix}$

projected onto the N_(T) last column vectors of Q_(k).

It is essential to realise that the interference vector i_(k) does not appear in expression (16). Since the projected noise vector, {tilde over (v)}_(k), is not spatially correlated, an ML detection can be made using:

$\begin{matrix} {{\hat{x}}_{k} = {\underset{x_{k}}{\arg \; \min}{{{\overset{\sim}{y}}_{k} - {R_{k}^{22}x_{k}}}}^{2}}} & (17) \end{matrix}$

This detection is much simpler that the exhaustive ML detection in which following and previous symbols, on the current carrier and on adjacent carriers, would have to be taken into account, to take account of intrinsic interference.

However, this detection does not use all available information on the symbols x_(k) because the N_(T) equations corresponding to the first block line of matrix R_(k) are not used (see expression (16)) as illustrated with relation to FIG. 2.

FIG. 2 symbolically represents a transmission of symbols between the transmitter and the receiver of a 2×2 FBMC-MIMO transmission system. Only carrier k was considered, since the scheme is exactly the same for all carriers k=0, . . . , M−1.

The left of FIG. 2 shows the symbols x_(k,n) ¹ and x_(k,n) ² transmitted by antennas 1 and 2 respectively. Similarly, intrinsic interference generated by the transmultiplexer filter and affecting these same symbols is represented by i_(k,n) ^(l) and i_(k,n) ².

At the receiver end, the observables obtained by projection of vector

${\overset{\Cup}{y}}_{k} = \begin{pmatrix} {\left( y_{k} \right)} \\ {\left( y_{k} \right)} \end{pmatrix}$

onto the 2N_(T)=4 columns of Q_(k), are represented.

The real symbols obtained by projection onto the first two columns of matrix Q_(k) are denoted y _(k,n) ¹ and y _(k,n) ², components of y _(k)=(q_(k) ¹, . . . ,q_(k) ^(N) ^(T) )^(T)y̆_(k) satisfying the relation:

y _(k) =R _(k) ¹¹ i _(k) +R _(k) ¹² x _(k) +v _(k)   (18)

in which v _(k) is obtained by projection of the real noise vector v̆_(k) onto the first two columns of matrix Q_(k).

Similarly, the real symbols obtained by projection onto the last two columns of matrix Q_(k) are denoted {tilde over (y)}_(k,n) ¹ and {tilde over (y)}_(k,n) ², components of {tilde over (y)}_(k).

It will be understood that observables {tilde over (y)}_(k,n) ¹ and {tilde over (y)}_(k,n) ² are not used by detection, although they contain information about the transmitted symbols x_(k,n) ¹, x_(k,n) ².

The result is that this ML detector is not optimal in that it does not fully use the diversity of the system.

The above-mentioned paper recommends that the detector performances can be improved by increasing the number of antennas and therefore the diversity, which makes the receiver significantly more complex.

Consequently, the purpose of this invention is to disclose an FBMC-MIMO transmission/reception system with ML detection that has better bit error rate (BER) and signal-to-noise ratio (SNR) performances, without correspondingly increasing the number of antennas.

Presentation of the Invention

This invention is defined by an FBMC-MIMO transmitter of a transmission system comprising a plurality (N_(T)) of transmission antennas and a same plurality of FBMC-OQAM modulators, each FBMC-OQAM modulator comprising an OQAM modulator and a bank of synthesis filters, each FBMC-OQAM modulator transforming a block of input symbols into FBMC symbols to be transmitted on a corresponding transmission antenna, said transmitter being advantageous in that, for each FBMC-OQAM modulator, the input symbols to a block are combined in pairs at the input to linear combination modules, a linear combination module receiving two input symbols to output a pair composed of a first combined symbol and a second combined symbol, the linear combination not being reduced to a trivial combination, the combined symbols thus obtained being interleaved in an interleaver before being input to said FBMC-OQAM modulator.

Advantageously, said linear combination is a rotation by an angle φ, the angle φ being chosen to be not a multiple integer of

$\frac{\pi}{2}.$

In this case, if the input symbols are QPSK symbols, the angle φ is chosen such that φ=0.15π.

Alternatively, if the input symbols are 16-QAM symbols, φ is chosen such that φ=0.09π.

Preferably, said interleaver interleaves combined symbols from the same pair such that they are carried by FBMC carriers that are not simultaneously affected by the same fading.

The invention also relates to an FBMC-MIMO transmission receiver comprising a plurality (N_(R)) of reception antennas and a same plurality of FBMC-OQAM demodulators, each FBMC-OQAM demodulator comprising an analysis filter bank followed by an OQAM demodulator, each FBMC-OQAM demodulator being associated with a corresponding reception antenna and, starting from the signal received on this antenna, outputting a plurality of complex symbols (y_(k,n) ^(l), k=0, . . . , M−1) corresponding to different FBMC carriers, said receiver comprising:

a plurality M of multiplexers to group symbols at the output from FBMC-OQAM demodulators by FBMC carrier, the symbols thus grouped at the output being represented in the form of a complex vector (y_(k)=(y_(k,n) ¹, . . . , y_(k,n) ^(N) ^(R) )^(T)) with size N_(R), each complex vector being associated with an FBMC carrier;

a deinterleaver to deinterleave the complex vectors thus obtained and to supply them in the form of pairs of complex vectors (y_(k), y_(k′));

a plurality M of projection modules, each projection module being associated with an FBMC carrier, k=0, . . . , M−1, and projecting the complex vector associated with this carrier onto the N_(T) last columns of an orthonormal matrix Q_(k) with size 2N_(R)×2N_(T) obtained by QR decomposition of matrix

${\overset{\Cup}{H}}_{k} = \begin{pmatrix} {- \left( H_{k} \right)} & {\left( H_{k} \right)} \\ {\left( H_{k} \right)} & {\left( H_{k} \right)} \end{pmatrix}$

in which H_(k) is the matrix with size N_(R)×N_(T) representing the MIMO channel for carrier k, each projection module outputting a projected real vector ({tilde over (y)}_(k)) with size 2N_(T);

a plurality of maximum likelihood detection modules, each of these modules receiving a pair of real vectors thus projected and using them to obtain the most probable transmitted symbols ({circumflex over (x)}_(k),{circumflex over (x)}_(k+1)).

Advantageously, each maximum likelihood detection module receiving two projected real vectors {tilde over (y)}_(k),{tilde over (y)}_(k), searches for the most probable transmitted symbols {circumflex over (x)}_(k), {circumflex over (x)}_(k+1) by means of

${{\hat{x}}_{k,{k + 1}} = {{\underset{x_{k},x_{k + 1}}{\arg \mspace{11mu} \min}\mspace{11mu} {{{\overset{\sim}{y}}_{k,k^{\prime}} - {{R_{k,k^{\prime}}^{22}(A)}x_{k,{k + 1}}}}}^{2}\mspace{14mu} {with}\mspace{14mu} x_{k,{k + 1}}} = \begin{pmatrix} x_{k} \\ x_{k + 1} \end{pmatrix}}},{{\overset{\sim}{y}}_{k,k^{\prime}} = \begin{pmatrix} {\overset{\sim}{y}}_{k} \\ {\overset{\sim}{y}}_{k^{\prime}} \end{pmatrix}},{{R_{k,k^{\prime}}^{22}(A)} = {\begin{pmatrix} R_{k}^{22} & 0 \\ 0 & R_{k^{\prime}}^{22} \end{pmatrix}R_{A}}},$

in which the matrices R_(k) ²² and R_(k′) ²² were obtained by QR decomposition of matrices H̆_(k) and H̆_(k′) respectively, and R_(A) is the matrix defined by:

$R_{A} = \begin{pmatrix} a_{11} & a_{12} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & a_{11} & a_{12} & 0 & \ldots & 0 \\ 0 & 0 & a_{11} & a_{12} & \ddots & 0 & 0 & 0 & \ddots & \vdots \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & \ldots & \ddots & \ldots & \ldots & \ldots & 0 & a_{11} & a_{12} \\ a_{21} & a_{22} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & a_{21} & a_{22} & 0 & \ldots & 0 \\ 0 & 0 & a_{21} & a_{22} & \ddots & 0 & 0 & 0 & \ldots & 0 \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & \ldots & \ldots & \ldots & \ldots & 0 & a_{21} & a_{22} \end{pmatrix}$

in which

$A = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}$

is the matrix representing the linear combination of symbols x_(k), x_(k+1), used in transmission.

Advantageously, matrix A is a rotation matrix with an angle φ, chosen to be not an integer multiple of

$\frac{\pi}{2}.$

Maximum likelihood detection modules preferably have soft outputs and each uses a sphere decoder.

BRIEF DESCRIPTION OF THE DRAWINGS

Other characteristics and advantages of the invention will become clear after reading preferred embodiments of the invention, with reference to the appended figures among which:

FIG. 1 diagrammatically shows a known FBMC-MIMO transmission/reception system according to the state of the art;

FIG. 2 diagrammatically represents a transmission of symbols between the transmitter and the receiver of a system according to FIG. 1;

FIG. 3 diagrammatically represents a transmitter of an FBMC-MIMO system according to one embodiment of the invention;

FIG. 4 diagrammatically represents a receiver of an FBMC-OFDM system according to one embodiment of the invention;

FIG. 5 diagrammatically represents a transmission of symbols between a transmitter according to FIG. 3 and a receiver according to FIG. 4;

FIGS. 6A and 6B illustrate the performances of an FBMC-MIMO according to one example embodiment of the invention in the case in which QPSK symbols are transmitted.

DETAILED PRESENTATION OF PARTICULAR EMBODIMENTS

The basic concept of this invention is to group symbols to be transmitted in pairs and to combine the symbols in each pair in the form of two distinct combinations, the combined symbols thus obtained being transmitted on two distinct FBMC carriers. It is thus proposed to introduce an additional degree of diversity by distributing information about a symbol to be transmitted on two independent carriers.

FIG. 3 diagrammatically represents a transmitter of an FBMC-MIMO system according to one embodiment of the invention.

This figure shows the transmitter in relation to an arbitrary antenna l=1, . . . , N_(T), all transmitters having the same structure. In particular, the characteristics of synthesis filter banks associated with the different transmission antennas are the same.

The transmitter comprises an FBMC-OQAM modulator 310 composed of an OQAM modulator and a synthesis filter bank that can be made in the time domain (polyphase filter) or in the frequency domain as indicated in the introduction part. This FBMC-OQAM modulator is identical to the modulators 110 ₁, . . . ,110 _(N) _(T) represented in FIG. 1.

The transmitter receives real symbols to be transmitted at its input, represented by x_(0,n) ^(l), . . . , x_(M−1,n) ^(l), the x_(k,n) ^(l) symbol relating to time n (or block n), to carrier k and to antenna l.

Symbols are grouped in pairs and a combination module 305 calculates two distinct linear combinations for each pair of symbols. It should be noted that the symbols of a particular pair are not necessarily contiguous. However, in order to simplify the presentation while remaining perfectly general, we assume in the following that the sequence of symbols in a particular pair is actually contiguous. Thus, two consecutive symbols, x_(2κ,n) ^(l) and x_(2κ+1,n) ^(l), even and odd ranks respectively, are combined in the following form:

$\begin{matrix} {\begin{pmatrix} z_{k,n}^{} \\ z_{{k + 1},n}^{} \end{pmatrix} = {A_{k}\begin{pmatrix} x_{k,n}^{} \\ x_{{k + 1},n}^{} \end{pmatrix}}} & (19) \end{matrix}$

in which A_(k) are non-trivial 2×2 matrices, in other words all the elements are non-null. In particular, the matrices A_(k) are distinct from the unit matrix and the null matrix.

The matrices A_(k) can depend on k but they are preferably chosen to be identical A_(k)=A. According to one example embodiment, A will be chosen equal to a rotation matrix:

$\begin{matrix} {A = {A_{\phi} = \begin{pmatrix} {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} \\ {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} \end{pmatrix}}} & (20) \end{matrix}$

where

$\phi \neq {\mu \frac{\pi}{2}}$

in which μ is a relative integer.

The combined symbols are then interleaved by an interleaver, 307, such that two combined signals z_(k,n) ^(l) and z_(k+1,n) ^(l) derived from the same pair are transmitted on different carriers. These carriers will advantageously be chosen to be independent, in other words at a sufficient spacing so as to not be affected by fading at the same time. The interleaving function σ is identical regardless of the transmitter.

In the following, it will be assumed that at the output from the interleaver, the combined symbol z_(k,n) ^(l) is carried by the carrier k and the combined symbol z_(k−1,n) ^(l) is carried by the carrier k′. Thus, after interleaving, z_(k′,n) ^(l) corresponds to z_(k+1,n) ^(l).

The combined symbols thus interleaved are input to the FBMC-OQAM modulator to be transmitted on the MIMO channel.

FIG. 4 diagrammatically represents a receiver of an FBMC-OFDM system according to one embodiment of the invention.

This receiver comprises a plurality of FBMC-OQAM demodulators, 410 ₁, . . . , 410 _(N) _(R) , each demodulator being associated with one reception antenna l=1, . . . , N_(R). Each demodulator comprises an analysis filter bank that can be made in the temporal domain or in the frequency domain, and an OQAM demodulator. These demodulators have the same structure as those shown 140 ₁, . . . , 140 _(N) _(R) on FIG. 1. In particular, the characteristics of analysis filter banks associated with the different reception antennas are the same.

Each FBMC-OQAM demodulator, 410, outputs a block of complex symbols y_(k,n) ^(l), k=1, . . . , M−1 at time n. These symbol blocks are grouped by carrier in the multiplexers 420 ₁, . . . , 420 _(M−1), each multiplexer 420 _(k) being associated with a carrier k^(k) and outputting the symbols y_(k,n) ^(l), l=1, . . . , N_(R), in the form of a complex vector y_(k)=(y_(k,n) ¹, . . . , y_(k,n) ^(N) ^(R) )^(T) with size N_(R).

The symbol vectors thus obtained are then deinterleaved by a deinterleaver performing the inverse operation (σ⁻¹) to that done at the transmitters.

In the following, two vectors y_(k) and y_(k′) corresponding to two carriers k and k+1 before interleaving will be considered.

Vector y_(k) is projected onto the N_(T) last column vectors of the matrix Q_(k), obtained by QR decomposition of the matrix H̆_(k) defined above. The vector thus projected is a real vector, denoted {tilde over (y)}_(k), with size N_(T).

Similarly, vector y_(k′) is projected onto the N_(T) last column vectors of the matrix Q_(k′), obtained by QR decomposition of the matrix H̆_(k′). The vector thus projected is a real vector, denoted {tilde over (y)}_(k′), also with size {tilde over (y)}_(k′)N_(T).

According to (16), we have the following relations:

{tilde over (y)} _(k) =R _(k) ²² z _(k) +{tilde over (v)} _(k)  (21-1)

{tilde over (y)} _(k′) =R _(k′) ²² z _(k′) +{tilde over (v)} _(k′)  (21-2)

that we can formally define more synthetically by:

$\begin{matrix} {\begin{pmatrix} {\overset{\sim}{y}}_{k} \\ {\overset{\sim}{y}}_{k^{\prime}} \end{pmatrix} = {{\begin{pmatrix} R_{k}^{22} & 0 \\ 0 & R_{k^{\prime}}^{22} \end{pmatrix}\begin{pmatrix} z_{k} \\ z_{k^{\prime}} \end{pmatrix}} + \begin{pmatrix} {\overset{\sim}{v}}_{k} \\ {\overset{\sim}{v}}_{k^{\prime}} \end{pmatrix}}} & (22) \end{matrix}$

or, allowing for the fact that

$\begin{pmatrix} z_{k,n}^{} \\ z_{k^{\prime},n}^{} \end{pmatrix} = {A_{\phi}\begin{pmatrix} x_{k,n}^{} \\ x_{{k + 1},n}^{} \end{pmatrix}}$

for l=1, . . . , N_(R):

$\begin{matrix} {\begin{pmatrix} {\overset{\sim}{y}}_{k} \\ {\overset{\sim}{y}}_{k^{\prime}} \end{pmatrix} = {{{R_{k,k^{\prime}}^{22}(\phi)}\mspace{11mu} \begin{pmatrix} x_{k} \\ x_{k + 1} \end{pmatrix}} + \begin{pmatrix} {\overset{\sim}{v}}_{k} \\ {\overset{\sim}{v}}_{k^{\prime}} \end{pmatrix}}} & \left( {23\text{-}1} \right) \end{matrix}$

in which:

$\begin{matrix} {{R_{k,k^{\prime}}^{22}(\phi)} = {\begin{pmatrix} R_{k}^{22} & 0 \\ 0 & R_{k^{\prime}}^{22} \end{pmatrix}R_{\phi}}} & \left( {23\text{-}2} \right) \end{matrix}$

where R_(φ) is the matrix with size 2N_(T)×2N_(T) defined by:

$\begin{matrix} {R_{\phi} = \begin{pmatrix} {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} & 0 & \ldots & 0 \\ 0 & 0 & {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} & \ddots & 0 & 0 & 0 & \ddots & \vdots \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & \ldots & \ddots & \ldots & \ldots & \ldots & 0 & {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} \\ {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} & 0 & \ldots & 0 \\ 0 & 0 & {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} & \ddots & 0 & 0 & 0 & \ldots & 0 \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & \ldots & \ldots & \ldots & \ldots & 0 & {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} \end{pmatrix}} & \left( {23\text{-}3} \right) \end{matrix}$

Namely for example in the case of 2 transmission antennas:

$\begin{matrix} {R_{\phi} = \begin{pmatrix} {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} & 0 & 0 \\ 0 & 0 & {\cos \mspace{11mu} \phi} & {\sin \mspace{11mu} \phi} \\ {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} & 0 & 0 \\ 0 & 0 & {{- \sin}\mspace{11mu} \phi} & {\cos \mspace{11mu} \phi} \end{pmatrix}} & \left( {23\text{-}4} \right) \end{matrix}$

More generally, when a non-trivial linear combination matrix

$A = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}$

is used to combine symbols at the transmitter, the expressions (23-1), (23-2) and (23-3) become:

$\begin{matrix} {\begin{pmatrix} {\overset{\sim}{y}}_{k} \\ {\overset{\sim}{y}}_{k^{\prime}} \end{pmatrix} = {{{R_{k,k^{\prime}}^{22}(A)}\begin{pmatrix} x_{k} \\ x_{k + 1} \end{pmatrix}} + \begin{pmatrix} {\overset{\sim}{v}}_{k} \\ {\overset{\sim}{v}}_{k^{\prime}} \end{pmatrix}}} & \left( {24\text{-}1} \right) \\ {{R_{k,k^{\prime}}^{22}(A)} = {\begin{pmatrix} R_{k}^{22} & 0 \\ 0 & R_{k^{\prime}}^{22} \end{pmatrix}R_{A}}} & \left( {24\text{-}2} \right) \end{matrix}$

where R_(A) is the matrix with size 2N_(T)×2N_(T) defined by:

$\begin{matrix} {R_{A} = \begin{pmatrix} a_{11} & a_{12} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & a_{11} & a_{12} & 0 & \ldots & 0 \\ 0 & 0 & a_{11} & a_{12} & \ddots & 0 & 0 & 0 & \ddots & \vdots \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & \ldots & \ddots & \ldots & \ldots & \ldots & 0 & a_{11} & a_{12} \\ a_{21} & a_{22} & 0 & 0 & \ldots & 0 & 0 & 0 & \ldots & 0 \\ 0 & 0 & 0 & \ldots & 0 & a_{21} & a_{22} & 0 & \ldots & 0 \\ 0 & 0 & a_{21} & a_{22} & \ddots & 0 & 0 & 0 & \ldots & 0 \\ \vdots & \vdots & \ddots & \ldots & \ldots & \ddots & \ddots & \ddots & \ddots & \vdots \\ 0 & 0 & 0 & \ldots & \ldots & \ldots & \ldots & 0 & a_{21} & a_{22} \end{pmatrix}} & \left( {24\text{-}3} \right) \end{matrix}$

In all cases, the projected real vectors, {tilde over (y)}_(k),{tilde over (y)}_(k′), are input to an ML detector 450 _(k) that estimates the most probable vectors {circumflex over (x)}_(k) and {circumflex over (x)}_(k+1), taking account of these observables, channel matrices H̆_(k) and H̆_(k′) (from which the upper triangular matrices R_(k) ²² and R_(k′) ²²) and the linear combination matrix A are deduced.

In other words, the vectors {circumflex over (x)}_(k) and {circumflex over (x)}_(k+1) are determined by:

$\begin{matrix} {{\hat{x}}_{k,{k + 1}} = {\underset{x_{k},x_{k + 1}}{{\arg \mspace{11mu} \min}\;}{{{\overset{\sim}{y}}_{k,k^{\prime}} - {{R_{k,k^{\prime}}^{22}(A)}x_{k,{k + 1}}}}}^{2}}} & (25) \end{matrix}$

and more particularly when matrix A is a rotation matrix:

$\begin{matrix} {{\hat{x}}_{k,{k + 1}} = {\underset{x_{k},x_{k + 1}}{{\arg \mspace{11mu} \min}\;}{{{\overset{\sim}{y}}_{k,k^{\prime}} - {{R_{k,k^{\prime}}^{22}(\phi)}x_{k,{k + 1}}}}}^{2}}} & (26) \end{matrix}$

in which

$x_{k,{k + 1}} = {{\begin{pmatrix} x_{k} \\ x_{k + 1} \end{pmatrix}\mspace{14mu} {and}\mspace{14mu} {\overset{\sim}{y}}_{k,k^{\prime}}} = {\begin{pmatrix} {\overset{\sim}{y}}_{k} \\ {\overset{\sim}{y}}_{k^{\prime}} \end{pmatrix}.}}$

The ML detector may be of the type with soft values as described in the paper by M. Caus et al. mentioned above. Alternatively, it may be a Sphere Decoder.

FIG. 5 diagrammatically represents a transmission of symbols between a transmitter and a receiver of an FBMC-OFDM system according to one example embodiment of the invention.

The FBMC-MIMO system considered is also 2×2, in other words it has 2 transmission antennas and 2 reception antennas. The structures of the transmitters and the receiver are shown in FIGS. 3 and 4 respectively.

At the left of FIG. 5, x_(k,n) ¹ and x_(k,n) ² represent the symbols transmitted by antennas 1 and 2 respectively on carrier k, and x_(k,n) ¹ and x_(k′,n) ² represent the symbols transmitted by the same antennas on carrier k′ in which k′=σ(k).

Similarly, intrinsic interference generated by the transmultiplexer filter and affecting these same symbols on carrier k is represented by i_(k,n) ¹ and i_(k,n) ², and by i_(k,n) ¹ and i_(k,n) ²

At the receiver end, the observables obtained by projection of vectors

${\overset{\Cup}{y}}_{k} = {{\begin{pmatrix} {\left( y_{k} \right)} \\ {\left( y_{k} \right)} \end{pmatrix}\mspace{14mu} {and}\mspace{14mu} {\overset{\Cup}{y}}_{k^{\prime}}} = \begin{pmatrix} {\left( y_{k^{\prime}} \right)} \\ {\left( y_{k^{\prime}} \right)} \end{pmatrix}}$

onto the N_(T) last column vectors of Q_(k) and Q_(k′), are represented by

${\overset{\sim}{y}}_{k} = {{\begin{pmatrix} {\overset{\sim}{y}}_{k^{\prime}}^{1} \\ {\overset{\sim}{y}}_{k}^{2} \end{pmatrix}\mspace{14mu} {and}\mspace{14mu} {\overset{\sim}{y}}_{k^{\prime}}} = \begin{pmatrix} {\overset{\sim}{y}}_{k^{\prime}}^{1} \\ {\overset{\sim}{y}}_{k^{\prime}}^{2} \end{pmatrix}}$

respectively.

The fact that two carriers are combined makes it possible to have twice as many observables as in prior art represented in FIG. 2. Everything takes place as if the number of transmission and reception antennas had been virtually doubled.

FIGS. 6A and 6B illustrate the performances of an FBMC-MIMO system according to one example embodiment of the invention, for an EVA (Extended Vehicular A) LTE channel and an ETU (Extended Typical Urban) LTE channel.

The FBMC-MIMO system considered used N_(T)=2 transmission antennas and N_(R)=2 reception antennas. The number of carriers was chosen to be equal to 50 out of 1024. A convolutional code with rate ⅔ was used.

The symbols to be transmitted were QPSK symbols. The ML detector was chosen with soft outputs as in the paper by M. Caus et al. mentioned above.

It can be seen in FIG. 6A that a gain of 1.10 dB on the signal-to-noise ratio can be achieved for a BER (bit error rate) equal to 10⁻⁴ if φ=0.15π is chosen. Performances of the known system according to prior art correspond to φ=0 (no rotation).

Similarly, it can be seen on FIG. 6B that a gain of 1.5 dB on the signal-to-noise ratio can be reached if we choose φ=0.15π.

More generally, it can be shown that there is an optimum angle φ for each type of modulation alphabet. Thus, when the symbols to be transmitted belong to a 16-QAM alphabet, the optimum angle φ=0.09π. 

1. A transmitter of an FBMC-MIMO transmission system comprising a plurality (N_(T)) of transmission antennas and a same plurality of FBMC-OQAM modulators, each FBMC-OQAM modulator comprising an OQAM modulator and a bank of synthesis filters, each FBMC-OQAM modulator transforming a block of input symbols into FBMC symbols to be transmitted on a corresponding transmission antenna, wherein, for each FBMC-OQAM modulator, the input symbols to a block are combined in pairs at the input to linear combination modules, a linear combination module receiving two input symbols to output a pair composed of a first combined symbol and a second combined symbol, the linear combination being obtained by means of combination coefficients that are all not null, the combined symbols thus obtained being interleaved in an interleaver before being input to said FBMC-OQAM modulator.
 2. The transmitter of an FBMC-MIMO transmission system according to claim 1, wherein the linear combination is a rotation by angle φ, the angle φ being chosen to be not equal to an integer multiple of $\frac{\pi}{2}.$
 3. The transmitter of an FBMC-MIMO transmission system according to claim 2, wherein the input symbols are QPSK symbols and that φ=0.15π.
 4. The transmitter of an FBMC-MIMO transmission system according to claim 2, wherein the input symbols are 16-QAM symbols and that φ=0.09π.
 5. The transmitter of an FBMC-MIMO transmission system according to claim 1, wherein said interleaver interleaves combined symbols from the same pair such that they are carried by FBMC carriers that are not simultaneously affected by the same fading.
 6. A receiver of an FBMC-MIMO transmission system comprising a plurality (N_(R)) of reception antennas and a same plurality of FBMC-OQAM demodulators (410 ₁, . . . , 410 _(N) _(R) ), each FBMC-OQAM demodulator comprising an analysis filter bank followed by an OQAM demodulator, each FBMC-OQAM demodulator being associated with a corresponding reception antenna and, starting from the signal received on this antenna, outputting a plurality of complex symbols (y_(k,n) ¹, k=0, . . . , M−1) corresponding to different FBMC carriers, wherein said receiver comprises: a plurality M of multiplexers (420 ₁, . . . , 420 _(M−1)) to group symbols at the output from FBMC-OQAM demodulators by FBMC carrier, the symbols thus grouped at the output being represented in the form of a complex vector (y_(k)=(y_(k,n) ¹, . . . , y_(k,n) ^(N) ^(R) )^(T)) with size N_(R) , each complex vector being associated with an FBMC carrier; a deinterleaver to deinterleave the complex vectors thus obtained and to supply them in the form of pairs of complex vectors (y_(k),y_(k′)); a plurality M of projection modules (440 _(k)), each projection module being associated with an FBMC carrier, k=0, . . . , M−1, and projecting the complex vector associated with this carrier onto the N_(T) last columns of an orthonormal matrix Q_(k) with size 2N_(R)×2N_(T) obtained by QR decomposition of matrix ${\overset{(}{H}}_{k} = \begin{pmatrix}  & \\  &  \end{pmatrix}$ in which H_(k) is the matrix with size N_(R)×N_(T) representing the MIMO channel for carrier k, each projection module outputting a projected real vector (y %_(k)) with size 2N_(T); a plurality of maximum likelihood detection modules (450 _(k)), each of these modules receiving a pair of real vectors thus projected and using them to deduce a pair of transmitted symbols ({circumflex over (x)}_(k), {circumflex over (x)}_(k+1)), the most probable having been combined using a linear combination during transmission.
 7. The receiver of an FBMC-MIMO transmission system according to claim 6, wherein a maximum likelihood detection module receiving two projected real vectors y %_(k), y %_(k), searches for the most probable transmitted symbols {circumflex over (x)}_(k), {circumflex over (x)}_(k−1) by means of ${{\hat{x}}_{k,{k + 1}} = {{\underset{x_{k},x_{k + 1}}{{\arg \mspace{11mu} \min}\;}{{y_{k,k^{\prime}}^{\%} - {{R_{k,k^{\prime}}^{22}(A)}x_{k,{k + 1}}}}}^{2}\mspace{14mu} {with}{\mspace{11mu} \;}x_{k,{k + 1}}} = \begin{pmatrix} x_{k} \\ x_{k + 1} \end{pmatrix}}},{y_{k,k^{\prime}}^{\%} = \; \begin{pmatrix} y_{k}^{\%} \\ y_{k^{\prime}}^{\%} \end{pmatrix}},{{R_{k,k^{\prime}}^{22}(A)} = \begin{pmatrix} R_{k}^{22} & 0 \\ 0 & R_{k^{\prime}}^{22} \end{pmatrix}}$ R_(A) in which the matrices R_(k) ²² and R_(k′) ²² were obtained by QR decomposition of matrices {grave over (H)}_(k) and {grave over (H)}_(k′) respectively, and R_(A) is the matrix defined by: $R_{A} = \begin{pmatrix} a_{11} & a_{12} & 0 & 0 & L & 0 & 0 & 0 & L & 0 \\ 0 & 0 & 0 & L & 0 & a_{11} & a_{12} & 0 & L & 0 \\ 0 & 0 & a_{11} & a_{12} & O & 0 & 0 & 0 & O & M \\ M & M & O & L & L & O & O & O & O & M \\ 0 & 0 & L & O & L & L & L & 0 & a_{11} & a_{12} \\ a_{21} & a_{22} & 0 & 0 & L & 0 & 0 & 0 & L & 0 \\ 0 & 0 & 0 & L & 0 & a_{21} & a_{22} & 0 & L & 0 \\ 0 & 0 & a_{21} & a_{22} & O & 0 & 0 & 0 & L & 0 \\ M & M & O & L & L & O & O & O & O & M \\ 0 & 0 & 0 & L & L & L & L & 0 & a_{21} & a_{22} \end{pmatrix}$ in which $A = \begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix}$ is the matrix representing the linear combination of symbols x_(k), x_(k+1), used in transmission.
 8. The receiver of an FBMC-MIMO transmission system according to claim 7, wherein matrix A is a rotation matrix to rotate by an angle φ, chosen to be not equal to an integer multiple of $\frac{\pi}{2}.$
 9. The receiver of an FBMC-MIMO transmission system according to claim 6, wherein the maximum likelihood detection modules have soft outputs.
 10. The receiver of an FBMC-MIMO transmission system according to claim 6, wherein each of the maximum likelihood detection modules uses a sphere decoder. 